/*
	Here is another mathematical problem, where the trick is as much to discover the algorithm as it is to write the code:
	write a program to display all possible permutations of a given input string--if the string contains duplicate characters,
	you may have multiple repeated results. Input should be of the form
*/

#include <iostream>
#include <string>

using namespace std;

int main( int argc, char* argv[] ){

	string InStr = argv[1];
	int Size = InStr.size();

	cout << Size << endl;
	

	return 0;
}
/*
kokotsky algoritmus jednoducha impleme
...
*/
